AG codes and AG quantum codes from the GGS curve
نویسندگان
چکیده
منابع مشابه
AG codes and AG quantum codes from the GGS curve
In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all Fq2-rational points of the curve is determined; the Feng-Rao designed minimum distance is computed for infinite families of such codes, as well as the automorphism group. As a result, some linear codes with better relative parameters with respect to one-point He...
متن کاملAG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
We investigate several types of linear codes constructed from two families S̃q and R̃q of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such curves are provided, and the Weierstrass semigroup H(P ) at an Fq-rational point P is shown to be symmetric.
متن کاملAG Codes from Polyhedral Divisors
A description of complete normal varieties with lower dimensional torus action has been given in [AHS08], generalizing the theory of toric varieties. Considering the case where the acting torus T has codimension one, we describe T -invariant Weil and Cartier divisors and provide formulae for calculating global sections, intersection numbers, and Euler characteristics. As an application, we use ...
متن کاملBoolean Functions from AG-Codes
Propagation criterion of degree l and order k (PC(l) of order k) and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1, 2, 3, 6, 7,8,10,11,16]. Kurosawa , Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, algebraic-geometric codes over GF (2) are used to modif...
متن کاملAG-codes on Elliptic Curves
For a secret sharing scheme, two parameters dmin and dcheat are defined in [1] and [2]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [1-3]. The MDS secret-sharing scheme is defined in [2] and it is proved that MDS perfect secret sharin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2017
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-017-0450-5